100+ results for 'i++; source:Github'

Not the results you expected?

MyHudNetgraph.cs (https://github.com/KeenSoftwareHouse/SpaceEngineers.git) C# · 343 lines

330 if (inputAbs < BYTE_MULTIPLIERS[i])

331 break;

332 i++;

333 }

334 i--;

ConvertCharset.class.php (https://github.com/umbecr/camilaframework.git) PHP · 307 lines

189 if (strlen($HexChar) == 1) $HexChar = "0" . $HexChar;

190 if (($this -> FromCharset == "gsm0338") && ($HexChar == '1B')){

191 $i++;

192 $HexChar .= strtoupper(dechex(ord($StringToChange[$i])));

193 }

RubyArrayTests.cs (https://github.com/shri/ironruby.git) C# · 359 lines

128 foreach (object item in a) {

129 Assert(item.Equals(values[i]));

130 i++;

131 }

132 Assert(i == values.Length);

h.java (https://github.com/HelloHuDi/AndroidReverseNotes.git) Java · 499 lines

379 z = true;

380 }

381 i++;

382 }

383 return z;

395 z = true;

396 }

397 i++;

398 }

399 return z;

hfi_parser.c (https://github.com/tekkamanninja/linux.git) C · 325 lines

158 rawfmts[i].fmt = pinfo->format;

159 rawfmts[i].buftype = fmt->buffer_type;

160 i++;

161

162 if (pinfo->num_planes > MAX_PLANES)

sql.php (https://github.com/shafiqissani/ASTRA-College-Website.git) PHP · 242 lines

60 $found_delimiter = false;

61 // Find first interesting character, several strpos seem to be faster than simple loop in php:

62 //while (($i < $len) && (strpos('\'";#-/', $buffer[$i]) === FALSE)) $i++;

63 //if ($i == $len) break;

64 $oi = $i;

140 break;

141 }

142 $i++;

143 // Aren't we at the end?

144 if ($finished && $i == $len) {

189 }

190 }

191 $i++;

192 }

193 // Skip last char

prof_init.c (https://github.com/rhuitl/uClinux.git) C · 402 lines

138 filenames[i][ent_len] = 0;

139 if (*t == 0) {

140 i++;

141 break;

142 }

TimerTest.cs (https://github.com/QuickJack/mono.git) C# · 327 lines

133 b, 10, Timeout.Infinite);

134 timers.Add (t);

135 i++;

136 t.Dispose ();

137 }

SDEInserter.java (https://github.com/rssh/termware2.git) Java · 273 lines

241 debug(i + " copying 8 bytes");

242 copy(8);

243 i++;

244 break;

245 case 1 : // Utf8

ieee80211_wx.c (http://omnia2droid.googlecode.com/svn/trunk/) C · 1033 lines ✨ Summary

This C code is part of a wireless networking driver, specifically for Linux. It provides functions to interact with wireless networks, including setting and getting various parameters such as encryption methods, authentication modes, and network settings. The code is likely used in a wireless networking stack, allowing userspace applications to control the behavior of the wireless device.

375

376 list_for_each_entry(network, &ieee->network_list, list) {

377 i++;

378 if((stop-ev)<200)

379 {

SpringLayoutUtil.java (https://github.com/revolsys/com.revolsys.open.git) Java · 320 lines

279 x = Spring.sum(x, Spring.width(component));

280 rowHeight = Spring.max(rowHeight, Spring.height(component));

281 i++;

282 }

283 y = Spring.sum(y, rowHeight);

WNafUtil.java (https://github.com/SivanLiu/HwFrameWorkSource.git) Java · 361 lines

153 if (add.testBit(i)) {

154 bArr[i - 1] = (byte) (bigInteger.testBit(i) ? -1 : 1);

155 i++;

156 }

157 i++;

osip_header.c (https://github.com/doghell/osip2.git) C · 309 lines

197 return i;

198 }

199 i++;

200 }

201 return OSIP_UNDEFINED_ERROR; /* not found */

SessionTest.php (https://github.com/maoueh/symfony.git) PHP · 256 lines

238 foreach ($this->session as $key => $val) {

239 $this->assertEquals($attributes[$key], $val);

240 $i++;

241 }

242

CSVReader.java (https://github.com/kanayo/liquibase.git) Java · 245 lines

209 // put one on the token. we do *not* exit the quoted text.

210 sb.append(nextLine.charAt(i+1));

211 i++;

212 }else{

213 inQuotes = !inQuotes;

FSGAgentState.java (https://github.com/pilarski/rlpark.git) Java · 271 lines

40 continue;

41 stateIndexes.put(s, ci);

42 ci++;

43 }

44 return stateIndexes;

83 if (s == graphState)

84 result.data[ci] = 1;

85 ci++;

86 }

87 return result;

144 continue;

145 d_pi.setEntry(i, i, d.getEntry(ci));

146 ci++;

147 }

148 return d_pi;

tsftomsu.c (https://bitbucket.org/freebsd/freebsd-head/) C · 39 lines ✨ Summary

This C function, tsftomsu, converts a time stamp fraction to milliseconds. It multiplies the input timestamp by 10 three times using long-integer arithmetic, effectively scaling the fractional part of the timestamp into milliseconds. The result is then rounded if necessary and returned as an integer.

34 */

35 if (round && (val_uf & 0x80000000))

36 val_ui++;

37 return (int)val_ui;

38 }

upravit.funkce.php (https://github.com/GE3/GE3.git) PHP · 116 lines

28 $i=0;

29 Do{

30 $i++;

31 $jedinecnyNazev = $friendlyName.($i>1?"-$i":"").".$pripona";

32 }While( file_exists("../zbozi/obrazky/$jedinecnyNazev") );

WildcardMatcher.java (https://github.com/ariesteam/thinklab.git) Java · 296 lines

196 return false;

197 }

198 i++;

199 currPosition += currStringLength;

200 }

MyLib.cpp (https://github.com/xiaocao/ltp.git) C++ · 424 lines

218 {

219 sentence += vecPair[i+1].first + "/" + vecPair[i+1].second + " ";

220 i++;

221 }

222 vecSentence.push_back(sentence);

341 return i;

342 else

343 i++;

344 }

345 }

ErrataEditor.pm (https://github.com/colloquium/spacewalk.git) Perl · 334 lines

170 substr($adv, -1, 1) = $i;

171 substr($adv_name, -1, 1) = $i;

172 $i++;

173 }

174 }

Tiger.jj (https://jedit.svn.sourceforge.net/svnroot/jedit) Unknown · 3333 lines

146 int i = 0;

147 do {

148 i++;

149 if (i > 100) {

150 break;

DonovanDriveTrain.java (https://github.com/prog694/frc.git) Java · 276 lines

100 rm = .5 + ((encoderLeft.get() - encoderRight.get()) / SCALE);

101 tankDrive((-1*lm), (-1*rm));

102 i++;

103 }

104 tankDrive(0, 0);

TcpListener.cs (https://github.com/hbons/SparkleShare.git) C# · 259 lines

148

149 Thread.Sleep (1000);

150 i++;

151 }

152

LEDMatrix.h (https://github.com/AaronLiddiment/LEDMatrix.git) C Header · 509 lines

315 p_LED[i] = p_LED[i + 1];

316 p_LED[i] = CRGB(0, 0, 0);

317 i++;

318 if (y > 1)

319 {

475 p_LED[i] = p_LED[i + 1];

476 p_LED[i] = CRGB(0, 0, 0);

477 i++;

478 if (x > 1)

479 {

CConfig.cpp (https://github.com/azboul/multitheftauto.git) C++ · 423 lines

67 szCurrentEntry[i] = '\0';

68 }

69 i++;

70 }

71 // If this is one of the entries we are looking for

79 return false;

80 }

81 i++;

82 if ( ( szInput[i] == '\0' ) || ( szInput[i] == '\n' ) || ( szInput[i] == '#' ) ) {

83 // Reset the file pointer to the start of the file

90 while ( szInput[i] != '#' && szInput[i] != '\n' && szInput[i] != '\0' ) {

91 szTemp[j] = szInput[i];

92 i++;

93 j++;

94 }

PropelModelPagerTest.php (https://github.com/1989gaurav/Propel.git) PHP · 241 lines

104 foreach ($pager as $book) {

105 $this->assertEquals('Book' . $i, $book->getTitle(), 'getIterator() returns an iterator');

106 $i++;

107 }

108 $this->assertEquals(4, $i, 'getIterator() uses the results collection');

117 foreach ($pager as $book) {

118 $this->assertEquals('Book' . $i, $book->getTitle(), 'getIterator() returns an iterator');

119 $i++;

120 }

121 $this->assertEquals(4, $i, 'getIterator() uses the results collection');

124 foreach ($pager as $book) {

125 $this->assertEquals('Book' . $i, $book->getTitle());

126 $i++;

127 }

128 $this->assertEquals(4, $i, 'getIterator() can be called several times');

test.c (https://github.com/rtemss/rtems.git) C · 439 lines

125 printf(" Failure\n");

126

127 i++;

128 }

129

194 printf( ": %s\n", strerror( errno ) );

195

196 i++;

197 }

198

trace_events_inject.c (https://github.com/tekkamanninja/linux.git) C · 327 lines

47 /* First find the field to associate to */

48 while (isspace(str[i]))

49 i++;

50 s = i;

51 while (isalnum(str[i]) || str[i] == '_')

52 i++;

53 len = i - s;

54 if (!len)

65 *pf = field;

66 while (isspace(str[i]))

67 i++;

68 if (str[i] != '=')

69 return -EINVAL;

class.TestMySQLDAO.php (https://github.com/billfox3/ThinkUp.git) PHP · 167 lines

66 $binds[':name'.$i] = $data[0];

67 $binds[':id'.$i] = $data[1];

68 $i++;

69 }

70 $sql .= $values;

aria.js (https://github.com/yangdao/kissy.git) JavaScript · 235 lines

45 trigger.id = S.guid("ks-switchable");

46 }

47 i++;

48 });

49 i = 0;

53 panel.setAttribute("aria-hidden", activeIndex == i ? "false" : "true");

54 panel.setAttribute("aria-labelledby", t.id);

55 i++;

56 });

57

gArray.cs (https://github.com/gegg2/Zombie-Wars.git) C# · 320 lines

284 while (x + i < 0)

285 {

286 i++;

287 }

288 for (int j = -1; j < 2; j++)

vtkQtChartQuad.cxx (https://github.com/b3c/VTK-5.8.git) C++ · 267 lines

123 if(code[i] == corner[0])

124 {

125 i++;

126 bool found = true;

127 for(int j = 1; found && j < 4; j++, i++)

localize_test.cpp (https://github.com/richardfickling/android_frameworks_base.git) C++ · 221 lines

139 app!=setting.apps.end(); app++) {

140 printf(" apps[%02d]='%s'\n", i, app->c_str());

141 i++;

142 }

143 i=0;

144 for (vector<Reject>::const_iterator reject=setting.reject.begin();

145 reject!=setting.reject.end(); reject++) {

146 i++;

147 printf(" reject[%02d]=('%s','%s','%s')\n", i, reject->file.c_str(),

148 reject->name.c_str(), reject->comment.c_str());

PolygonClippingAndMerging.java (https://github.com/ihmcrobotics/ihmc-open-robotics-software.git) Java · 359 lines

49 regionsToFilter.remove(i);

50 else

51 i++;

52 }

53 }

102 }

103

104 i++;

105 }

106 }

listGridCMS_PROJECTS.php (https://github.com/juddy/GIP.git) PHP · 309 lines

274 ?>

275 <?

276 $i++;

277

278 } // end while loop

string.cpp (https://github.com/grapefrukt/poro.git) C++ · 553 lines

296 return_value.replace( pos, what.size(), with );

297 pos = return_value.find( what, pos );

298 i++;

299 }

300

SimpleCharStream.java (https://github.com/adegtiar/mesos.git) Java · 439 lines

416 bufcolumn[j] = newCol + columnDiff;

417 columnDiff = nextColDiff;

418 i++;

419 }

420

TBlock.c (https://jetpp.svn.sourceforge.net/svnroot/jetpp) C · 810 lines ✨ Summary

This C code implements a block-based untransform function for image processing, specifically for wavelet transforms. It breaks down an image into smaller blocks and applies various transformations to each block, including transpose, spin up/down, and wavelet operations. The code is designed to optimize memory usage and performance by reusing blocks and minimizing data movement.

284

285 bptr += 8; // point to next line in blocks !

286 yi++;

287 if ( yi == 8 )

288 {

443 rowtoblock(bptr,workrow,w8);// block <- workrow ; back in the blocks

444

445 yi++;

446 bptr += 8; // point to next line in blocks !

447 if ( yi == 8 )

file.cpp (https://github.com/lince/ginga-srpp.git) C++ · 378 lines

371 if (toupper(f1[i])!=toupper(f2[i]))

372 return NO;

373 i++;

374 }

375 return (YESNO) (f1[i]==f2[i]);

init_utils_run.c (https://github.com/mkedwards/android_external_alsa-utils.git) C · 247 lines

60 }

61 dbg("arg[%i] '%s'", i, argv[i]);

62 i++;

63 }

64 argv[i] = NULL;

AST_timeoncall.php (https://github.com/inktel/Vicidial.git) PHP · 180 lines

65 $sessions .= "$row[0]|";

66 }

67 $i++;

68 }

69 $sessions = preg_replace("/\|$/",'',$sessions);

110 }

111

112 $i++;

113 }

114

146 echo "| $G$LIVE_stations_FORMAT[$i]$EG | $G$LIVE_sessions_FORMAT[$i]$EG | $G$channel$EG | $G$number_dialed$EG | $G$start_time$EG | $G$call_time_MS$EG |\n";

147

148 $i++;

149 }

150

extendMap.enchant.js (https://github.com/tkayama/hanachin.github.com.git) JavaScript · 313 lines

149 return false;

150 } else {

151 i++;

152 }

153 }

BitTools.cs (https://github.com/slau/ManagedMediaHelpers.git) C# · 335 lines

239 if (pattern[pati] == (data[di] & mask[pati]))

240 {

241 pati++;

242 }

243 else if (pattern[pati] != (data[di] & mask[pati]))

250 }

251

252 di++;

253

254 if (pati == pattern.Length)

MyersDiff.java (https://github.com/sorzu/xwiki-platform.git) Java · 197 lines

120 while (i < N && j < M && orig[i].equals(rev[j]))

121 {

122 i++;

123 j++;

124 }

quadtree.js (https://github.com/abachman/jaws.git) JavaScript · 211 lines

125 }

126 else {

127 i++;

128 }

129 }

ClientCookieDecoder.cs (https://github.com/Azure/DotNetty.git) C# · 266 lines

55 || c == '\r' || c == ' ' || c == ';')

56 {

57 i++;

58 continue;

59 }

81 // NAME=VALUE

82 nameEnd = i;

83 i++;

84 if (i == headerLen)

85 {

97 else

98 {

99 i++;

100 }

101

List.cpp (https://github.com/gehldp/OpenEaagles.git) C++ · 410 lines

388 while (i < n && p != nullptr) {

389 p = p->getNext();

390 i++;

391 }

392 if (p != nullptr)

helper_touch_action_complex.html (https://github.com/rillian/firefox.git) HTML · 143 lines

20 var i = 0;

21 while (true) {

22 i++;

23 var element = document.getElementById('configuration_' + i);

24 if (element == null) {

post-memory.c (https://github.com/cAPSLOCK7/EVBSP-SRC.git) C · 321 lines

127 *pUART_THR = buff[i];

128 SSYNC();

129 i++;

130 }

131 for (i = 0; i < 0x80000; i++)

K8sNamespaceManagerTest.java (https://github.com/opennetworkinglab/onos.git) Java · 218 lines

212 for (Event event : testListener.events) {

213 assertEquals("Incorrect event received", types[i], event.type());

214 i++;

215 }

216 testListener.events.clear();

std_vector.i (https://swig.svn.sourceforge.net/svnroot/swig) Unknown · 569 lines

115 $result = newRV_noinc((SV*) myav);

116 sv_2mortal($result);

117 argvi++;

118 }

119 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T> {

285 $result = newRV_noinc((SV*) myav);

286 sv_2mortal($result);

287 argvi++;

288 }

289 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T *> {

456 $result = newRV_noinc((SV*) myav);

457 sv_2mortal($result);

458 argvi++;

459 }

460 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T> {

private_settings.php (https://github.com/wangaiying/elgg4ysu.git) PHP · 419 lines

238 $operand $value)";

239

240 $i++;

241 }

242

nis_defaults.c (https://github.com/nitinkamble/glibc.git) C · 455 lines

77 i = 0;

78 while (dptr[i] != '\0' && dptr[i] != ':')

79 i++;

80 if (i == 0) /* only "ttl=" ? */

81 return DEFAULT_TTL;

138 i = 0;

139 while (cptr[i] != '\0' && cptr[i] != ':')

140 i++;

141 if (i == 0) /* only "access=" ? */

142 return 0;

wrapfunc.c (https://github.com/nmacherey/rheia.git) C · 528 lines

480 Clear(nname);

481 Printf(nname,"%s%d",name,i);

482 i++;

483 }

484 Replace(ndecl, name, nname, DOH_REPLACE_ID);

strings.js (https://github.com/wheresjames/winglib.git) JavaScript · 308 lines

146 {

147 // Skip %

148 i++;

149

150 var pre = 0, post = 0;

203

204 // Next character

205 i++;

206

207 } // end while

NameNode.cs (https://github.com/pruiz/mono.git) C# · 189 lines

172 if (text[i] == esc) {

173 if (i+1 < pos && charsToEscape.IndexOf(text[i+1]) >= 0) {

174 i++;

175 }

176 }

arith_uint256.h (https://github.com/bitcoinx-project/bitcoinx.git) C Header · 299 lines

182 int i = 0;

183 while (i < WIDTH && ++pn[i] == 0)

184 i++;

185 return *this;

186 }

199 int i = 0;

200 while (i < WIDTH && --pn[i] == (uint32_t)-1)

201 i++;

202 return *this;

203 }

meshTriangulation.C (https://github.com/xyuan/OpenFOAM-1.7.x.git) C · 511 lines

143 faceMap_[triI] = faceI;

144

145 triI++;

146 }

147 }

ChukwaArchiveKey.java (https://github.com/thainb/Honu.git) Java · 360 lines

76 _rio_j++;

77 }

78 _rio_i++;

79 }

80 }

OrderResource.java (https://github.com/imyousuf/jersey.git) Java · 196 lines

129 {

130 if (i >= start && i < start + size) list.add(order);

131 i++;

132 }

133 // next link

scatterreduc.c (https://github.com/Milkyway-at-home/nemo.git) C · 355 lines

283 *s++ = '\n';

284 block_room -= j + 1;

285 i++;

286 }

287

291 *s++ = '\n';

292 block_room -= j + 1;

293 i++;

294 }

295

evented.test.js (https://github.com/production-minds/flock.git) JavaScript · 298 lines

44

45 function testHandler() {

46 i++;

47 }

48

56

57 function stopHandler() {

58 i++;

59 return false;

60 }

110

111 function testHandler() {

112 i++;

113 }

114

DnsSdTxtRecord.java (https://github.com/dstmath/HWFramework.git) Java · 277 lines

100 if (key.length() > avLen || !((key.length() == avLen || this.mData[(key.length() + avStart) + 1] == 61) && key.compareToIgnoreCase(new String(this.mData, avStart + 1, key.length())) == 0)) {

101 avStart += (avLen + 1) & Process.PROC_TERM_MASK;

102 i++;

103 } else {

104 byte[] oldBytes = this.mData;

132 return true;

133 }

134 i++;

135 }

136 }

225 return getValue(i);

226 }

227 i++;

228 }

229 }

JPGEncoder.as (http://e-cards-plugin.googlecode.com/svn/trunk/) ActionScript · 649 lines ✨ Summary

The ActionScript code generates a JPEG image from a provided BitmapData. It initializes Huffman tables, sets up color quantization and macroblock encoding parameters, and then encodes 8x8 blocks of pixels into YUV format using the H.261 video standard. The encoded data is written to a ByteArray object, which can be used as output for further processing or storage.

113 fdtbl_Y[i] = (1.0 / (YTable [ZigZag[i]] * aasf[row] * aasf[col] * 8.0));

114 fdtbl_UV[i] = (1.0 / (UVTable[ZigZag[i]] * aasf[row] * aasf[col] * 8.0));

115 i++;

116 }

117 }

536 writeBits(HTAC[nrzeroes*16+category[32767+DU[i]]]);

537 writeBits(bitcode[32767+DU[i]]);

538 i++;

539 }

540 if ( end0pos != 63 ) {

SimpleCharStream.java (https://github.com/thiagoarrais/eclipsefp.git) Java · 471 lines

447 bufcolumn[j] = newCol + columnDiff;

448 columnDiff = nextColDiff;

449 i++;

450 }

451

fachadaInterface.php (https://github.com/danielvaleradp/--ngara.git) PHP · 150 lines

95 if ($Jugador->posicion == 'P') {

96 $TmpP[$i] = self::consultarEstadisticas($Jugador);

97 $i++;

98 } else {

99 $TmpB[$j] = self::consultarEstadisticas($Jugador);

plopt.c (https://github.com/l--putt/nuttx-bb.git) C · 215 lines

78 i += 2;

79 } /* end if */

80 else i++;

81 break;

82

125 nchanges++;

126 } /* end if */

127 else i++;

128 break;

129

130 default :

131 i++;

132 break;

133 } /* end switch */

ConnectFour_434.js (https://github.com/ingrahaj/CTArcade.git) JavaScript · 348 lines

242

243 if (direction == 'DIAG1') {

244 i++;

245 j++;

246 } else if (direction == 'DIAG2') {

CTokenMarker.java (https://github.com/AndreiSochirca/nativelibs4java.git) Java · 271 lines

139 if(array[i1] == '/')

140 {

141 i++;

142 addToken((i+1) - lastOffset,token);

143 token = Token.NULL;

StringUtil.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 123 lines ✨ Summary

This Java class provides utility methods for string manipulation, including splitting strings by a delimiter, sorting arrays of strings using bubble sort, finding the maximum common prefix between two strings, generating method signatures as strings, and normalizing class names. It also includes a hack to access a private method in another class.

76 int i=0;

77 while( one.regionMatches( 0, two, 0, i ) )

78 i++;

79 return one.substring(0, i-1);

80 }

Tiger.jj (https://jedit.svn.sourceforge.net/svnroot/jedit) Unknown · 4099 lines

166 int i = 0;

167 do {

168 i++;

169 if (i > 100) {

170 return t;

HistoryComboBox.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 106 lines ✨ Summary

This Java class, HistoryComboBox, extends JComboBox to create a combo box that remembers a specified number of previous entries and stores them in a given property. It allows users to interact with the combo box as usual while also persisting its state between sessions. The class provides methods for adding new entries, storing and loading data from properties.

79 //Log.log(Log.DEBUG,this,"Setting '"+name+"."+i+"' to '"+getItemAt(i)+"'");

80 jEdit.setProperty(name + "." + i, getItemAt(i).toString());

81 i++;

82 }

83 jEdit.unsetProperty(name + "." + i);

98 }

99 query = jEdit.getProperty(name + "." + i);

100 i++;

101 }

102 setSelectedItem("");

BrowserColorsOptionPane.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 346 lines ✨ Summary

This Java code creates a GUI component for managing browser colors. It allows users to add, remove, and edit color settings for different file types. The component displays a table with two columns: one for glob patterns and another for corresponding colors. Users can select new colors from a palette or enter custom values. The changes are saved when the user clicks “Save”.

181 "vfs.browser.colors." + i + ".color",

182 Color.black)));

183 i++;

184 }

185 } //}}}

StylesheetParameterTableModel.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 237 lines ✨ Summary

This Java code defines a table model for XSL stylesheet parameters, allowing users to add, edit, and delete parameter names and values in a table. It provides methods for adding, removing, and editing parameters, as well as getting the current value of each parameter at a specific row and column index.

188 fireTableRowsDeleted(i, i);

189 }

190 i++;

191 }

192

mzscheme.cxx (https://swig.svn.sourceforge.net/svnroot/swig) C++ · 817 lines ✨ Summary

This C++ code is part of a Scheme interpreter implementation, specifically for the MZSCHEME module. It defines a class MZSCHEME that inherits from a base class, and provides methods to instantiate the module, handle syntax and semantics, and validate identifiers. The code appears to be generated by a tool like SWIG (Simplified Wrapper and Interface Generator) for creating C++ bindings around Scheme code.

83 Swig_mark_arg (i);

84 Swig_mark_arg (i + 1);

85 i++;

86 } else {

87 Swig_arg_error();

JavaCharStream.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 548 lines ✨ Summary

This Java class implements a line-based text scanner, allowing for tokenization and adjustment of line and column numbers at the start of a token. It reads input from an underlying stream (e.g., file or network connection) and provides methods to get the current line and column numbers, as well as the next character in the input. The class also supports adjusting the starting point of a token within the input.

524 bufcolumn[j] = newCol + columnDiff;

525 columnDiff = nextColDiff;

526 i++;

527 }

528

TokenMarker.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 938 lines ✨ Summary

This Java code is part of a parser for regular expressions, specifically handling line-by-line parsing and syntax analysis. It manages persistent state per line, including rules, escape characters, and span information, to facilitate accurate parsing and error detection. The code provides a framework for processing input strings according to predefined grammar rules.

749 buf.append(match.group(

750 digit - '0'));

751 i++;

752 }

753 else

763 else

764 buf.append(ch);

765 i++;

766 }

767 }

Resolver.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 969 lines ✨ Summary

This Java code is part of a JEdit plugin that manages external resources, such as XML files. It handles caching, network modes, and resource updates. The code provides methods for adding, updating, and removing resources from the cache, as well as handling changes to the user’s settings and file system. It also includes a class for handling VFS (Virtual File System) updates.

285 String uri = null;

286 do {

287 String prop = "xml.catalog." + i++;

288 uri = jEdit.getProperty(prop);

289 if (uri == null) break;

Chunk.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 589 lines ✨ Summary

This Java code is part of a text rendering engine, responsible for laying out and rendering text on a screen. It uses font substitution to find suitable fonts for characters that can’t be rendered by the default font. The code creates glyph vectors, which represent the visual representation of text, and calculates their widths based on the chosen font.

245 family.equalsIgnoreCase("dialog"))

246 userFonts.add(f);

247 i++;

248 }

249

cwrap.c (https://swig.svn.sourceforge.net/svnroot/swig) C · 1468 lines ✨ Summary

This C code is part of a wrapper generator for creating C wrappers around Python modules. It provides functions to generate C code for various operations, such as setting and getting global variables, static member variables, and function calls. The generated C code can be used to interface with the Python module from C programs.

237 Wrapper_add_localv(w, lname, local, NIL);

238 Delete(local);

239 i++;

240 }

241 Delete(lname);

357 Delete(rcaststr);

358 comma = 1;

359 i++;

360 }

361 p = nextSibling(p);

439 Printf(func, "%s(", nname);

440

441 i++;

442 p = nextSibling(p);

443 while (p) {

Patch.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 395 lines ✨ Summary

This Java code implements a patch editor that applies changes to a text file by applying chunks of text, known as “patches”, to the original file. It supports three types of patches: add (insertion), change (replacement), and delete (removal). The code uses an offset-based system to apply patches to the original file, allowing for precise control over where in the file each patch is applied.

334 log( "--- change() - Adding(2): " + changeTo[ j ] );

335 buff.add( changeTo[ j ] );

336 i++;

337 }

338 // fix the current line, this may have change due to insertion or removal of lines

Abbrevs.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 595 lines ✨ Summary

This Java code defines a text expansion system for a programming language. It allows users to define abbreviations with variables, which are replaced by actual values when expanded. The system supports backslashes, tabs, and positional parameters (e.g., $n for the nth parameter). The code provides classes for parsing and generating these expansions, as well as saving and loading them to/from files.

566 if(Character.isDigit(ch) && ch != '0')

567 {

568 i++;

569

570 int pos = ch - '0';

ExtensionManager.java (https://jedit.svn.sourceforge.net/svnroot/jedit) Java · 176 lines ✨ Summary

This Java code is part of an editor’s extension management system, handling ‘layers’ of extensions that can be added to a text area. It provides methods for adding, removing, and retrieving extensions, as well as painting screen line ranges and displaying tooltips. The code uses a linked list to store the extensions, allowing for efficient insertion and removal.

44 return;

45 }

46 i++;

47 }

48

lang.cxx (https://swig.svn.sourceforge.net/svnroot/swig) C++ · 476 lines ✨ Summary

This C++ code is a part of a compiler or interpreter for a programming language, specifically designed to generate C++ code from a high-level language syntax tree. It defines functions that handle various aspects of C++ code generation, such as class declarations, function definitions, variable assignments, and pragmas. The code uses a syntax tree data structure to navigate the abstract syntax tree (AST) and generate corresponding C++ code.

249 while (baseclass[i]) {

250 // cplus_inherit_members(baseclass[i],mode);

251 i++;

252 }

253 */

parms.c (https://swig.svn.sourceforge.net/svnroot/swig) C · 245 lines ✨ Summary

This C code is part of a SWIG (Simplified Wrapper and Interface Generator) project, which generates C wrappers for Python modules. It defines functions to create and manipulate Parm objects, which represent function parameters, as well as related data structures like ParmList. The code provides methods for copying, stringifying, and checking default arguments in parameter lists.

113 return i;

114 if (!(SwigType_type(t) == T_VOID))

115 i++;

116 else

117 break;

128 int i = 0;

129 while (p) {

130 i++;

131 p = nextSibling(p);

132 }

genimpl.c (git://pkgs.fedoraproject.org/scilab) C · 179 lines

59 i = 0;\

60 if (STEP<(Type)0) {\

61 for (j=FIRST;j>=LAST;j=j+STEP) {i++;}\

62 }\

63 else if (STEP>(Type)0) {\

64 for (j=FIRST;j<=LAST;j=j+STEP) {i++;}\

65 }\

66 else {\

main.c (http://omnia2droid.googlecode.com/svn/trunk/) C · 1787 lines ✨ Summary

This C code is a Linux kernel module that provides a library for Libertas WLAN drivers. It implements various functions, including event queueing, command response handling, and RTAP interface support. The code initializes and exits the module, and sets up debugfs interfaces for configuration and monitoring purposes. It also handles device operations such as opening, stopping, and transmitting data over the network.

696 lbs_deb_net("mcast address %s:%pM added to filter\n", dev->name,

697 mc_list->dmi_addr);

698 i++;

699 }

700 netif_addr_unlock_bh(dev);

houdini_js_u.c (git://github.com/brianmario/escape_utils.git) C · 60 lines ✨ Summary

This C function, houdini_unescape_js, takes a buffer ob and a string src as input, and returns 1 if successful. It unescapes special characters in the input string, replacing them with their corresponding characters (e.g., \n becomes \n). If an invalid character is encountered, it appends a backslash to the output buffer.

13 org = i;

14 while (i < size && src[i] != '\\')

15 i++;

16

17 if (likely(i > org)) {

47 case '/':

48 gh_buf_putc(ob, ch);

49 i++;

50 break;

51

README.md (git://github.com/Rduerden/Node.cs.git) Markdown · 108 lines ✨ Summary

Node.cs is a C# framework that provides evented I/O for building high-performance single-threaded applications. It includes features such as HTTP server, timers, task completion, and threading support. The framework also supports UDP message receiving. Node.cs allows developers to create asynchronous operations without the need for threads, making it suitable for building scalable and efficient applications.

60 int ii = 0;

61

62 c.AsyncWork( () => t.ScheduleTimer( ts, h => {ii++; c.AsyncWorkComplete();} ));

63 c.AsyncWork( () => t.ScheduleTimer( ts, h => {ii++;c.AsyncWorkComplete();} ));

issue59_test.html (http://jsplumb.googlecode.com/svn/trunk/) HTML · 438 lines ✨ Summary

This HTML code generates a workflow diagram with interconnected boxes and arrows, using JavaScript libraries like jsPlumb to create the layout and connections. It also includes a menu system for navigating the diagram and a code preview area at the bottom of the page. The diagram is rendered dynamically based on data provided in the HTML code.

325 );

326 }

327 child_i++;

328 child_box = json_data[child_i];

329 }

ai_utils.cpp (http://hl2sb-src.googlecode.com/svn/trunk/) C++ · 581 lines

261 d = d * m_invDecay;

262 m_decayTime = m_decayTime + 0.1 * d; // appox interval call

263 i++;

264 }

265 }

mlme.c (http://photon-android.googlecode.com/svn/) C · 2582 lines ✨ Summary

This C code is part of a wireless networking driver, specifically handling management frames for IEEE 802.11 networks. It implements functions to manage associations, disassociations, and deauthentications between devices on an 802.11 network, as well as sending and receiving management frames to/from the network. The code ensures proper locking and synchronization to prevent race conditions when accessing shared data structures.

335 *pos++ = rates_len - count;

336

337 for (i++; i < sband->n_bitrates; i++) {

338 if (BIT(i) & rates) {

339 int rate = sband->bitrates[i].bitrate;

NewLocationActivity.java (http://eyes-free.googlecode.com/svn/trunk/) Java · 434 lines ✨ Summary

This Java code is part of an Android application that provides a search functionality for addresses. It allows users to input an address, which can be from various sources such as contacts, favorites, or manual entry. The app then searches for the address and returns its corresponding latitude and longitude coordinates to the caller activity.

399 Entry<String, String> entry = it.next();

400 items[i] = entry.getKey();

401 i++;

402 }

403