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

Not the results you expected?

trigger_code.pl (https://misterhouse.svn.sourceforge.net/svnroot/misterhouse) Perl · 223 lines

49 trigger_set($trigger, $code, $type, $name, 1, $triggered);

50 $trigger = $code = $name = $type = $triggered = '';

51 $i++;

52 }

53 }

143 if ($triggers{$name}) {

144 my $i = 2;

145 while ($triggers{"$name $i"}) { $i++; }

146 $name = "$name $i";

147 }

bspdegelev.m (https://octave.svn.sourceforge.net/svnroot/octave) Objective C · 294 lines

207 end % }

208 end % }

209 i = i + 1; % i++;

210 j = j - 1; % j--;

211 kj = kj - 1; % kj--;

bfont.c (https://ironhells.svn.sourceforge.net/svnroot/ironhells) C · 929 lines

82 x < (Font->Surface->w); ++x) ;

83 Font->Chars[i].w = (x - Font->Chars[i].x);

84 i++;

85 }

86 else

366 {

367 x += PutCharFont(Surface, Font, x, y, text[i]);

368 i++;

369 }

370 }

385 {

386 x += CharWidth(Font, text[i]);

387 i++;

388 }

389

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

This C code is part of a compiler or interpreter for a programming language, specifically a wrapper function generator. It provides functions to print out wrapper functions, add local variable declarations, and check if local names have already been declared. The code uses a hash table to store local variables and their corresponding declarations.

481 Clear(nname);

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

483 i++;

484 }

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

typemaps.i (https://swig.svn.sourceforge.net/svnroot/swig) Swig · 381 lines ✨ Summary

This Swig code is used to generate C++ wrappers for a reference-counted interface, likely a library or framework. It provides macros and directives to handle memory management, type conversions, and function overloading, allowing C++ developers to easily interface with the underlying reference-counted API. The output will be a set of C++ header files that can be used as a bridge between C/C++ code and the reference-counted library.

182 $result = sv_newmortal();

183 sv_setiv($result,(IV) *($1));

184 argvi++;

185 }

186

195 $result = sv_newmortal();

196 sv_setuv($result,(UV) *($1));

197 argvi++;

198 }

199

208 $result = sv_newmortal();

209 sv_setnv($result,(double) *($1));

210 argvi++;

211 }

212

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

This Java class represents a literal token in an abstract syntax tree (AST) for a programming language. It encapsulates information about the type of token, its value, and provides methods to compare and hash tokens. The class overrides standard Object methods like equals, hashCode, and toString to provide custom behavior for AST nodes.

63 char c = image.charAt(i);

64 if ((c == '\\') && (i + 1 < l)) {

65 i++;

66 c = image.charAt(i);

67 if (c == 'n') {

89 if ((image.length() > i) && (image.charAt(i + 1) >= '0')

90 && (image.charAt(i + 1) <= '7')) {

91 i++;

92 c = (char) ((c << 4) | octval(image.charAt(i)));

93 }

lklist.c (https://sdcc.svn.sourceforge.net/svnroot/sdcc) C · 1273 lines

327 }

328 }

329 i++;

330 }

331 putc('\n', mfp);

454 while (i < nmsym) {

455 fprintf(mfp, "\t\t%s\t%04X\n", p[i]->s_id, p[i]->s_addr + p[i]->s_axp->a_addr );

456 i++;

457 }

458 free(p);

768 }

769 }

770 i++;

771 }

772 free(p);

shared_survey_bar_graph.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 816 lines ✨ Summary

This C code processes survey data from XML files, parsing and analyzing the results to generate graphs and text responses. It checks for multi-choice answers, sorts values, sets title elements, generates bar graphs, and creates text responses based on the parsed data. The output is stored in a new file with the same name as the input survey result file.

219 while(choice->current)

220 {

221 i++;

222 choice->current = choice->current->next;

223 }

271 cs_set_value(name, tmp_value);

272 }

273 i++;

274 choice->current = choice->current->next;

275 }

307 nl_to_space(choice->current->choice);

308 cs_set_value(name, choice->current->choice);

309 i++;

310 choice->current = choice->current->next;

311 }

test_fakemon.c (https://supermon.svn.sourceforge.net/svnroot/supermon) C · 159 lines ✨ Summary

This C program uses a socket to send and receive S-expressions, a mathematical notation used for formal specification and verification. It creates a monhole, a socket-like interface, and sends updates and events to it, which are then received back. The program can be configured with various options, such as chunk size and sleep duration, to control the rate of sending and receiving data.

151 printf("blah sez: %s\n", my_buff); fflush(stdout);

152 #endif

153 i++;

154 }

155

GenreTable.cpp (https://cdexos.svn.sourceforge.net/svnroot/cdexos) C++ · 236 lines

99 case 0:

100 newEntry.btID3V1ID = atoi( lpszToken );

101 i++;

102 break;

103 case 1:

105 newEntry.strGenre.TrimLeft();

106 newEntry.strGenre.TrimRight();

107 i++;

108 break;

109 case 2:

111 newEntry.strCDDBGenre.TrimLeft();

112 newEntry.strCDDBGenre.TrimRight();

113 i++;

114 break;

115 }

GString.cpp (https://lgi.svn.sourceforge.net/svnroot/lgi) C++ · 888 lines

695 while (*a++)

696 {

697 i++;

698 }

699

wud.c (https://exult.svn.sourceforge.net/svnroot/exult) C · 327 lines

314 {

315 printfunc(f, func, i, func_table, funsize);

316 i++;

317 }

318 if( func == -1 )

XMidiEventList.cpp (https://exult.svn.sourceforge.net/svnroot/exult) C++ · 233 lines

94 buffer <<= 8;

95 buffer |= ((value & 0x7F) | 0x80);

96 i++;

97 }

98 if (!dest) return i;

147 {

148 if (dest) dest->write1(event->status);

149 i++;

150 }

151

170 case 0xC: case 0xD:

171 if (dest) dest->write1(event->data[0]);

172 i++;

173 break;

174

str_lib.cpp (https://cdexos.svn.sourceforge.net/svnroot/cdexos) C++ · 256 lines

221

222 do {

223 i++;

224 chars_to_copy--;

225 } while (src[i]=='0');

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

This Java class implements a character stream for parsing ASCII Unicode escape sequences. It provides methods to initialize, reinitialize, and advance through the stream, as well as adjust line and column numbers for token boundaries. The class also includes methods to get the current image string, suffix characters, and perform cleanup when done.

497 bufcolumn[j] = newCol + columnDiff;

498 columnDiff = nextColDiff;

499 i++;

500 }

501

class.ipmiinfo.inc.php (https://phpsysinfo.svn.sourceforge.net/svnroot/phpsysinfo) PHP · 195 lines

49 $result[$i]['state'] = $buffer[3];

50 $result[$i]['limit'] = $buffer[8];

51 $i++;

52 }

53 }

71 $result[$i]['state'] = $buffer[3];

72 $result[$i]['min'] = $buffer[8];

73 $i++;

74 }

75 }

94 $result[$i]['min'] = $buffer[5];

95 $result[$i]['max'] = $buffer[8];

96 $i++;

97 }

98 }

OGL_Blitter.cpp (https://marathon.svn.sourceforge.net/svnroot/marathon) C++ · 141 lines

71 glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, tile_size, tile_size, 0, GL_RGBA, GL_UNSIGNED_BYTE, t->pixels);

72

73 i++;

74 }

75 }

shared_survey_page.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 315 lines ✨ Summary

This C code is part of a survey management system, responsible for setting up and populating survey content. It iterates through a linked list of survey data structures, applying different settings based on the tag name (e.g., title, likert, choice, text, memo). The set_survey_content function updates the survey’s metadata, including ordering, colors, and other properties, to prepare it for display or submission.

306 set_custom_data(ptr, i);

307

308 i++;

309 list->current = list->current->next;

310 }

read_options.m (https://octave.svn.sourceforge.net/svnroot/octave) Objective C · 184 lines

139 end

140 end

141 ii++;

142

143 if length (ii) > 1 # Ambiguous option name

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

This Java code is a part of a lexical analyzer or scanner, responsible for breaking down input text into individual tokens such as keywords, identifiers, and symbols. It maintains state information about the current line and column numbers, adjusting them when necessary to accurately track token boundaries. The class provides methods to retrieve the token image, suffix, and buffers, as well as adjust the beginning line and column numbers for a given token start position.

602 bufcolumn[j] = newCol + columnDiff;

603 columnDiff = nextColDiff;

604 i++;

605 }

606

shared_grade_book_bar_graph_util.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 299 lines ✨ Summary

This C code is used to generate bar graphs for various data sets, including grades and student performance. It creates intervals based on a given number of points, updates counts for each interval, and sets values for the graph using these counts. The code also handles different types of data, such as letter grades and total scores, and generates scales and labels accordingly.

174 cs_set_value(name, temp);

175

176 i++;

177

178 }

206 snprintf(temp, MAX_TMP, "%d", ptr->count);

207 cs_set_value(name, temp);

208 i++;

209 }

210 cs_set_int_value("number_scales", i);

260 snprintf(temp, MAX_TMP, "%d", ptr->count);

261 cs_set_value(name, temp);

262 i++;

263 }

264 cs_set_int_value("number_scales", i);

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

This C code defines a set of functions for creating and managing wrapper functions, which are used to wrap existing functions with additional functionality. The functions allow for the creation of new wrapper functions, adding local variable declarations, checking if variables have been declared, and pretty-printing the contents of a wrapper function.

260 Clear(nname);

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

262 i++;

263 }

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

slptool.c (https://openslp.svn.sourceforge.net/svnroot/openslp) C · 382 lines

226 strcasecmp(argv[i],"--scopes") == 0 )

227 {

228 i++;

229 if(i < argc)

230 {

239 strcasecmp(argv[i],"--lang") == 0 )

240 {

241 i++;

242 if(i < argc)

243 {

254

255 /* service type */

256 i++;

257 if(i < argc)

258 {

BdUtils.java (https://tfal.svn.sourceforge.net/svnroot/tfal) Java · 224 lines

146 quit = true;

147 }

148 i++;

149 if (i>=sqlTypes.length)

150 quit = true;

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

This Swig code generates C++ wrappers for a Python library, allowing C++ code to interact with Python data types and vice versa. It defines classes and functions that map Python types (e.g., bool, int) to their corresponding C++ types (e.g., std::bool, int), enabling seamless communication between the two languages.

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> {

std_vector.i (https://swig.svn.sourceforge.net/svnroot/swig) Swig · 410 lines ✨ Summary

This Swig code generates C++ wrappers for a Perl module, allowing C++ code to interact with the Perl module’s functionality. It defines classes and functions that map to the Perl module’s API, providing a way for C++ code to call Perl functions and access its data structures, such as vectors and strings.

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

121 sv_2mortal($result);

122 argvi++;

123 }

124 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T> {

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

295 sv_2mortal($result);

296 argvi++;

297 }

298 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T> {

gib_function.c (https://quake.svn.sourceforge.net/svnroot/quake) C · 277 lines

178 var->array[0].value = dstring_newstr ();

179 dstring_copystr (var->array[0].value, args[i]);

180 i++;

181 return i < argc;

182 }

216 var->array[0].value = dstring_newstr ();

217 dstring_copystr (var->array[0].value, args[i]->str);

218 i++;

219 return i < argc;

220 }

Text.cxx (https://openjade.svn.sourceforge.net/svnroot/openjade) C++ · 411 lines

145 if (items_[i].index != lastIndex) {

146 items_.resize(items_.size() + 1);

147 i++;

148 for (size_t j = items_.size() - 1; j > i; j--)

149 items_[j] = items_[j - 1];

qplot.c (https://rxvt.svn.sourceforge.net/svnroot/rxvt) C · 258 lines ✨ Summary

This C code is a graphical plotting program that displays data points on a window, allowing users to interactively zoom and pan the plot. The program reads data from a file or standard input, calculates axis limits, and draws lines or dots representing the data. It also includes features like axis labels, title, and interactive zooming.

171 while (((x[i] < xmin) || (x[i] > xmax) ||

172 (y[i] < ymin) || (y[i] > ymax)) && (i < nls [j]))

173 i++;

174

175 while (i < nls [j])

185 continue;

186 }

187 i++;

188 while ((i < nls [j]) &&

189 ((x [i] < xmin) || (x [i] > xmax) ||

190 (y [i] < ymin) || (y [i] > ymax)))

191 i++;

192 }

193 if (n > 0)

Cell.cc (https://freespeech.svn.sourceforge.net/svnroot/freespeech) C++ · 419 lines ✨ Summary

This C++ code defines a Cell class, which represents a node in a decision tree. It stores information about the cell’s dimension, number of classes, terminal status, and child nodes (if applicable). The class provides methods for setting numbering, determining belonging to a cell based on input features, calculating templates, printing the cell’s details, and reading from an input stream.

103 if (data[k].second[dim] >= thresh)

104 {

105 sumAi++;

106 Ai[data[k].first]++;

107 } else {

108 sumBi++;

109 Bi[data[k].first]++;

110 }

170 if (data[k].second[dim] >= thresh)

171 {

172 sumAi++;

173 Ai[data[k].first]++;

174 } else {

timers.pl (https://misterhouse.svn.sourceforge.net/svnroot/misterhouse) Perl · 129 lines

100 next;

101 }

102 $i++;

103 $time_left = int $time_left;

104 next if $time_left < 10;

csalerts_sdl.cpp (https://marathon.svn.sourceforge.net/svnroot/marathon) C++ · 179 lines

68 if (t[i] == ' ')

69 last = i;

70 i++;

71 }

72 if (i != strlen(t))

binary_tree.cc (https://sonicflow.svn.sourceforge.net/svnroot/sonicflow) C++ · 335 lines

62 expr[i] == '\n')

63 {

64 i++;

65 }

66 switch (expr[i])

80 current = current->left;

81 }

82 i++;

83 break;

84 case END_SEPARATOR:

95 current = current->parent;

96 }

97 i++;

98 break;

99 case NODE_SEPARATOR:

Ubern.cc (https://octave.svn.sourceforge.net/svnroot/octave) C++ · 134 lines

74 fp=1.0;fn=1.0;df=1.0;segno=1.0;

75 while (fabs(df) > 2.2204e-16){

76 ii++;

77 segno= -segno;

78 df=df*x/ii;

edtfunc.c (https://octave.svn.sourceforge.net/svnroot/octave) C · 380 lines

118 }

119 }

120 i++;

121

122 /* Middle pixels have all neighbors */

gstring.cc (https://sdcc.svn.sourceforge.net/svnroot/sdcc) C++ · 520 lines

218 for ( ; *temp_str != '\0'; temp_str++) {

219 if (*temp_str == *_token && strncmp(_token, temp_str, len) == 0) {

220 i++;

221 }

222 }

PickRecruiter.java (https://colossus.svn.sourceforge.net/svnroot/colossus) Java · 144 lines

85 recruiterPane.add(chit);

86 chit.addMouseListener(this);

87 i++;

88 }

89

Partitioner.java (https://cmusphinx.svn.sourceforge.net/svnroot/cmusphinx) Java · 152 lines

37 Token current = tokens[j];

38 if (current.getScore() >= pivot.getScore()) {

39 i++;

40 setToken(tokens, j, tokens[i]);

41 setToken(tokens, i, current);

42 }

43 }

44 i++;

45 setToken(tokens, r, tokens[i]);

46 setToken(tokens, i, pivot);

mvArray.java (https://maverick.svn.sourceforge.net/svnroot/maverick) Java · 288 lines

198 while (i + 1 < slength && s.charAt(i + 1) == c) {

199 array[index].append(c);

200 i++;

201 }

202 index++;

addressbook_match.c (https://eucalyptus.svn.sourceforge.net/svnroot/eucalyptus) C · 253 lines

30 ae = (AddressEntry *)ae->Node.ln_Succ)

31 {

32 i++;

33

34 if(num == i)

46 aem = (AddressEntry *)aem->Node.ln_Succ)

47 {

48 i++;

49

50 if(num == i)

74 ae = (AddressEntry *)ae->Node.ln_Succ)

75 {

76 i++;

77

78 if(ae == aematch)

schoolday.pl (https://misterhouse.svn.sourceforge.net/svnroot/misterhouse) Perl · 240 lines

92

93 #print("School=$school, Term=$i, Start=$terms{$school}{terms}[$i][0], Finish=$terms{$school}{terms}[$i][1]\n");

94 $i++;

95 }

96

105 #print("School=$school, Inset=$i, Date=$terms{$school}{insets}[$i]\n");

106

107 $i++;

108 }

109

class.quotas.inc.php (https://phpsysinfo.svn.sourceforge.net/svnroot/phpsysinfo) PHP · 133 lines

102 $quotas[$i]['file_percent_used'] = 0;

103 }

104 $i++;

105 }

106 }

deltaT-gen.c (https://plplot.svn.sourceforge.net/svnroot/plplot) C · 171 lines

121 {

122 sscanf( readbuffer, "%lf %lf", (double *) &xspline[i], (double *) &yspline[i] );

123 i++;

124 }

125

super_log_data.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 331 lines ✨ Summary

This C code is a CGI program that processes log data from a file, either by printing individual records or all records for a given user and log file. It takes input parameters such as username and log file name, and outputs a URL to continue the process if long processing is enabled. The output includes CSV files based on the input parameter.

133 ptr->browser = malloc_str(line);

134 }

135 i++;

136 }

137 i =0;

178 else if (i ==5)

179 ptr->browser = malloc_str(line);

180 i++;

181 if(i ==6)

182 {

SimpleCharStream.java (https://colossus.svn.sourceforge.net/svnroot/colossus) Java · 508 lines

483 bufcolumn[j] = newCol + columnDiff;

484 columnDiff = nextColDiff;

485 i++;

486 }

487

MessageReporter.cxx (https://openjade.svn.sourceforge.net/svnroot/openjade) C++ · 240 lines

156 if (text[i] == '%') {

157 if (i + 1 < text.size()) {

158 i++;

159 if (text[i] == '1')

160 os() << *origin->entityName();

e_search.h (https://edge.svn.sourceforge.net/svnroot/edge) C Header · 179 lines

79 while (1) \

80 { \

81 do { i++; } \

82 while (CMP(arr[i], arr[b-1])); \

83 \

nnai.c (https://plplot.svn.sourceforge.net/svnroot/plplot) C · 432 lines

235 {

236 case 'a':

237 i++;

238 nn_rule = NON_SIBSONIAN;

239 break;

240 case 'n':

241 i++;

242 if ( i >= argc )

243 nn_quit( "no number of data points found after -i\n" );

244 nin = atoi( argv[i] );

245 i++;

246 if ( i >= argc )

247 nn_quit( "no number of ouput points per side found after -i\n" );

qplot.c (https://rxvt.svn.sourceforge.net/svnroot/rxvt) C · 250 lines ✨ Summary

This C code generates a graphical user interface for displaying and interacting with data points on a graph. It creates a window with an outline box, draws lines or dots to represent the data points, and allows the user to zoom in and out of the graph by clicking on specific coordinates. The program also displays axis labels and updates the display accordingly.

168 while (((x[i] < xmin) || (x[i] > xmax) ||

169 (y[i] < ymin) || (y[i] > ymax)) && (i < nls[j]))

170 i++;

171

172 while (i < nls[j]) {

181 continue;

182 }

183 i++;

184 while ((i < nls[j]) &&

185 ((x[i] < xmin) || (x[i] > xmax) ||

186 (y[i] < ymin) || (y[i] > ymax)))

187 i++;

188 }

189 if (n > 0)

aifffile.cpp (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ · 186 lines

137 // datas are stored in unsigned 8 bit but mixer engine only support signed 8 bit

138 *ptr++=dummy0-128;

139 i++;

140 }

141 }

156 dummy1 = Stream; addStream(1);

157 *ptr++=csSndFunc::makeWord(dummy0, dummy1);

158 i++;

159 }

160 }

__voronoi__.cc (https://octave.svn.sourceforge.net/svnroot/octave) C++ · 158 lines

126 v(i,d) = *(voronoi_vertex++);

127 }

128 i++;

129 neighbor->seen = True;

130 neighbor->visitid = i;

cstreend.h (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ Header · 114 lines

71 foundNode = ((csTreeNode*)children.Get (i))->DSF (TreeFunc, SelBranch,

72 param, stopOnSuccess);

73 i++;

74 }

75 return foundNode;

mail-wrapper.c (https://mailman.svn.sourceforge.net/svnroot/mailman) C · 170 lines

91 return 1;

92 }

93 i++;

94 }

95 return 0;

127 return 1;

128 }

129 i++;

130 }

131 return 0;

m04adr.c (https://sdcc.svn.sourceforge.net/svnroot/sdcc) C · 114 lines

58 return(sp[i].a_val);

59 }

60 i++;

61 }

62 ip = ips;

BaseRuleGrammar.java (https://cmusphinx.svn.sourceforge.net/svnroot/cmusphinx) Java · 412 lines

139 for (JSGFRule subrule : ruleAlternatives.getRules()) {

140 subrules[i] = convert (subrule);

141 i++;

142 }

143 float[] weights = null;

147 for (Float f : ruleAlternatives.getWeights()) {

148 weights[i] = f;

149 i++;

150 }

151 }

159 for (JSGFRule subrule : ruleSequence.getRules()) {

160 subrules[i] = convert (subrule);

161 i++;

162 }

163 return new RuleSequence(subrules);

post_outbox_info.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 280 lines ✨ Summary

This C code generates a CGI (Common Gateway Interface) script that retrieves and displays information about an email inbox and outbox for a specific course. It reads configuration settings, validates user credentials, and fetches data from databases to display attachment and recipient information. The script is designed to be used in a web application, likely as part of an email client or management system.

117 snprintf(name, MAX_TMP_NAME, "to.%d.realname", i);

118 cs_set_value(name, pptr->data.realname);

119 i++;

120 }

121 }

146 snprintf(name, MAX_TMP_NAME, "cc.%d.realname", i);

147 cs_set_value(name, pptr->data.realname);

148 i++;

149 }

150

178 snprintf(name, MAX_TMP_NAME, "bcc.%d.realname", i);

179 cs_set_value(name, pptr->data.realname);

180 i++;

181 }

182

shared_survey_table.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 290 lines ✨ Summary

This C code generates a CSV file containing survey results from a list of records, each representing a record in a survey table. It processes the data by iterating through each record and its corresponding survey questions, printing out the relevant values to the CSV file. The output is formatted with quotes around field names and values, and includes a header row indicating question numbers.

44 {

45 ptr = ptr->next;

46 i++;

47 }

48 cs_set_int_value("number_question", i);

71 cs_set_value(name, ptr->value);

72 ptr=ptr->next;

73 i++;

74 }

75

89

90 for( ptr = one_record->head; ptr; ptr = ptr->next)

91 i++;

92 return i;

93 }

admin_list_students_in_courses.c (https://manhattan.svn.sourceforge.net/svnroot/manhattan) C · 257 lines ✨ Summary

This C code is part of a CGI program that manages course information and student enrollment. It reads course data from a database, updates configuration files, validates user permissions, and generates an HTML page displaying enrolled students in each course. The program can be accessed by authorized users (faculty or admin) and displays the list of students in courses for those users.

200 {

201 set_one_course(ptr, crs_person, key, crs, group, i, &count);

202 i++;

203 }

204

tk_photos.pl (https://misterhouse.svn.sourceforge.net/svnroot/misterhouse) Perl · 133 lines

75

76 my $i = $Save{photo_index};

77 ($mode eq 'previous') ? $i-- : $i++;

78 $i = 0 if $i > $#photos;

79 $i = $#photos if $i < 0;

viavoice_control.pl (https://misterhouse.svn.sourceforge.net/svnroot/misterhouse) Perl · 142 lines

125 if ($count < 4) {

126 for (@list) {

127 $i++;

128 $text .= "$i, $_. ";

129 }

m08adr.c (https://sdcc.svn.sourceforge.net/svnroot/sdcc) C · 206 lines

148 return(sp[i].a_val);

149 }

150 i++;

151 }

152 ip = ips;

parse.cpp (https://xplanet.svn.sourceforge.net/svnroot/xplanet) C++ · 252 lines

37 return;

38 }

39 i++;

40 }

41 }

47 {

48 if (isEndOfLine(line[i])) return;

49 i++;

50 }

51 }

64 strncpy(returnstring, (line + istart), i - istart);

65 returnstring[i-istart] = '\0';

66 i++;

67 return(true);

68 }

GHttpUi.cpp (https://lgi.svn.sourceforge.net/svnroot/lgi) C++ · 317 lines

232 {

233 *o++ = ' ';

234 i++;

235 }

236 else if (*i == '%')

242 else

243 {

244 *o++ = *i++;

245 }

246 }

addArcs.cpp (https://xplanet.svn.sourceforge.net/svnroot/xplanet) C++ · 266 lines

33 while (isDelimiter(line[i]))

34 {

35 i++;

36 if (static_cast<unsigned int> (i) > strlen(line)) return;

37 }

225 xpWarn(errStr.str(), __FILE__, __LINE__);

226 }

227 ii++;

228 }

229 }

260 xpWarn(errStr.str(), __FILE__, __LINE__);

261 }

262 ii++;

263 }

264 }

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

This C code is part of a SWIG (Simplified Interface to C and other languages) module, specifically for handling input files. It reads command line options, sets up search paths, and checks out input files from the SWIG library. If no file is specified, it generates an input file with include statements for the provided directories and libraries.

66 outfile = NewString(argv[i+1]);

67 Swig_mark_arg(i+1);

68 i++;

69 } else {

70 Swig_arg_error();

slpd_cmdline.c (https://openslp.svn.sourceforge.net/svnroot/openslp) C · 201 lines

123 if(strcmp(argv[i],"-l") == 0)

124 {

125 i++;

126 if(i >= argc) goto USAGE;

127 strncpy(G_SlpdCommandLine.logfile,argv[i],MAX_PATH-1);

129 else if(strcmp(argv[i],"-r") == 0)

130 {

131 i++;

132 if(i >= argc) goto USAGE;

133 strncpy(G_SlpdCommandLine.regfile,argv[i],MAX_PATH-1);

135 else if(strcmp(argv[i],"-c") == 0)

136 {

137 i++;

138 if(i >= argc) goto USAGE;

139 strncpy(G_SlpdCommandLine.cfgfile,argv[i],MAX_PATH-1);

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

This Java code defines a Bookmarks class that extends AbstractTableModel. It provides a model for displaying bookmarks with titles and URLs in a table, allowing users to add, delete, move up/down, and save changes to the bookmark data. The data is stored in a vector of BookmarksEntry objects, which are accessed through methods like getTitle, getURL, and delete.

155 jEdit.setProperty("infoviewer.bookmarks.title." + count, b.title);

156 jEdit.setProperty("infoviewer.bookmarks.url." + count, b.url);

157 i++;

158 count++;

159 }

ldbList.java (https://maverick.svn.sourceforge.net/svnroot/maverick) Java · 106 lines

94 if (tpos > -1) {

95 sb.append(MANGLE_CHARS.charAt(tpos));

96 i++;

97 }

98 } else {

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

This Java code creates a graphical user interface (GUI) for customizing line guides and marks in a text editor, specifically jEdit. It allows users to add, remove, and customize marks/guides, as well as save their settings to the application’s configuration. The GUI displays a table of existing marks/guides, with options to edit or delete them.

41 m.setColor(jEdit.getColorProperty("options.columnruler.marks." + i + ".color", Color.WHITE));

42 guides.add(m);

43 i++;

44 name = jEdit.getProperty("options.columnruler.marks." + i + ".name");

45 }

SoundMgr.cpp (https://jetpp.svn.sourceforge.net/svnroot/jetpp) C++ · 502 lines ✨ Summary

This C++ code implements a sound management system for an application. It provides methods to create, modify, and control sounds, including playing, stopping, modifying, and checking if a sound is currently playing. The system also manages master volume settings. The code appears to be part of a larger audio processing framework, likely used in game development or multimedia applications.

95 {

96 JE_SAFE_DELETE(i->second);

97 i++;

98 }

99

104 {

105 JE_SAFE_DELETE(i->second);

106 i++;

107 }

108

243 }

244

245 i++;

246 }

247

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

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

This Java class, MarkManager, is a singleton that manages static marks (e.g., column guides) in a text editor. It loads and saves mark configurations from/to the editor’s settings, adds/removes marks, checks for mark existence, and notifies registered listeners of mark-related events. The class provides methods to interact with these marks, such as adding, removing, and updating them.

38 m.setSize(jEdit.getIntegerProperty("options.columnruler.marks." + i + ".size", 1));

39 marks.add(m);

40 i++;

41 name = jEdit.getProperty("options.columnruler.marks." + i + ".name");

42 }

LegionInfoPanel.java (https://colossus.svn.sourceforge.net/svnroot/colossus) Java · 257 lines

146 marker.setLocation(i * (effectiveChitSize + padding) + margin,

147 margin);

148 i++;

149 }

150

223 chit.setLocation(i * (effectiveChitSize + padding) + margin,

224 margin);

225 i++;

226 }

227

236 sizeLabel.setSize(new Dimension(effectiveChitSize,

237 effectiveChitSize));

238 i++;

239 }

240

EntityApp.cxx (https://openjade.svn.sourceforge.net/svnroot/openjade) C++ · 198 lines

134 }

135 else

136 i++;

137 }

138 }

175 }

176 else

177 i++;

178 }

179 }

LegionInfoPanel.java (https://colossus.svn.sourceforge.net/svnroot/colossus) Java · 260 lines

150 marker.setLocation(i * (effectiveChitSize + padding) + margin,

151 margin);

152 i++;

153 }

154

227 chit.setLocation(i * (effectiveChitSize + padding) + margin,

228 margin);

229 i++;

230 }

231

240 sizeLabel.setSize(new Dimension(effectiveChitSize,

241 effectiveChitSize));

242 i++;

243 }

244

slpd_cmdline.c (https://openslp.svn.sourceforge.net/svnroot/openslp) C · 200 lines

123 if(strcmp(argv[i],"-l") == 0)

124 {

125 i++;

126 if(i >= argc) goto USAGE;

127 strncpy(G_SlpdCommandLine.logfile,argv[i],MAX_PATH-1);

129 else if(strcmp(argv[i],"-r") == 0)

130 {

131 i++;

132 if(i >= argc) goto USAGE;

133 strncpy(G_SlpdCommandLine.regfile,argv[i],MAX_PATH-1);

135 else if(strcmp(argv[i],"-c") == 0)

136 {

137 i++;

138 if(i >= argc) goto USAGE;

139 strncpy(G_SlpdCommandLine.cfgfile,argv[i],MAX_PATH-1);

slpd_cmdline.c (https://openslp.svn.sourceforge.net/svnroot/openslp) C · 177 lines

100 if (strcmp(argv[i],"-l") == 0)

101 {

102 i++;

103 if (i >= argc) goto USAGE;

104 strncpy(G_SlpdCommandLine.logfile,argv[i],MAX_PATH);

106 else if (strcmp(argv[i],"-r") == 0)

107 {

108 i++;

109 if (i >= argc) goto USAGE;

110 strncpy(G_SlpdCommandLine.regfile,argv[i],MAX_PATH);

112 else if (strcmp(argv[i],"-c") == 0)

113 {

114 i++;

115 if (i >= argc) goto USAGE;

116 strncpy(G_SlpdCommandLine.cfgfile,argv[i],MAX_PATH);

wud.c (https://exult.svn.sourceforge.net/svnroot/exult) C · 296 lines

283 {

284 printfunc(f, func, i);

285 i++;

286 }

287 if( func == -1 )

slpd_cmdline.c (https://openslp.svn.sourceforge.net/svnroot/openslp) C · 105 lines

64 if(strcmp(argv[i],"-l") == 0)

65 {

66 i++;

67 if(i >= argc) goto USAGE;

68 strncpy(G_SlpdCommandLine.logfile,argv[i],MAX_PATH);

70 else if(strcmp(argv[i],"-r") == 0)

71 {

72 i++;

73 if(i >= argc) goto USAGE;

74 strncpy(G_SlpdCommandLine.regfile,argv[i],MAX_PATH);

76 else if(strcmp(argv[i],"-c") == 0)

77 {

78 i++;

79 if(i >= argc) goto USAGE;

80 strncpy(G_SlpdCommandLine.cfgfile,argv[i],MAX_PATH);

hpdfcata.c (https://harbour-project.svn.sourceforge.net/svnroot/harbour-project) C · 384 lines

116 if (HPDF_StrCmp (layout->value, HPDF_PAGE_LAYOUT_NAMES[i]) == 0)

117 return (HPDF_PageLayout)i;

118 i++;

119 }

120

147 if (HPDF_StrCmp (mode->value, HPDF_PAGE_MODE_NAMES[i]) == 0)

148 return (HPDF_PageMode)i;

149 i++;

150 }

151

MessageFormatter.cxx (https://openjade.svn.sourceforge.net/svnroot/openjade) C++ · 176 lines

73 while (i < text.size()) {

74 if (text[i] == '%') {

75 i++;

76 if (i >= text.size())

77 break;

82 else

83 os.put(text[i]);

84 i++;

85 }

86 else {

87 os.put(text[i]);

88 i++;

89 }

90 }

gendoc.cc (https://freespeech.svn.sourceforge.net/svnroot/freespeech) C++ · 134 lines ✨ Summary

The code generates an HTML document that displays information about available nodes and their documentation. It loads node data from a UIDocument object, creates a table with links to each node’s page, and then generates HTML for each node’s documentation using the node2html function. The resulting HTML is output to the console.

113 out << "</tr>\n";

114 count++;

115 i++;

116 }

117 if (count %3!=0)

125 {

126 node2html(i->first, i->second, out);

127 i++;

128 }

129 out << "\n</body>\n"

io.c (https://supermon.svn.sourceforge.net/svnroot/supermon) C · 191 lines ✨ Summary

This C code reads and parses s-expressions (a Lisp-like data structure) from a file descriptor, returning the parsed string as a null-terminated C string. It handles nested parentheses, skips over whitespace characters like CR and LF, and checks for buffer overflow errors. The read_sexp function is similar to fread_sexp, but uses read instead of fgetc.

60

61 sexp[i] = ch;

62 i++;

63 depth++; /* inc depth since we know we have a '(' */

64

80 {

81 sexp[i] = ch;

82 i++;

83 }

84

138

139 sexp[i] = ch;

140 i++;

141 depth++; /* inc depth since we know we have a '(' */

142

html.php (https://squirrelmail.svn.sourceforge.net/svnroot/squirrelmail) PHP · 186 lines

173 echo $format_ar[$i];

174 }

175 $i++;

176 }

177 }

identity.php (https://squirrelmail.svn.sourceforge.net/svnroot/squirrelmail) PHP · 216 lines

159

160 if ($key == $id) {

161 $i++;

162 $fixed[$i] = $tmp_hold;

163 }

192

193 // Inc array index //

194 $i++;

195 }

196

std_list.i (https://swig.svn.sourceforge.net/svnroot/swig) Swig · 368 lines ✨ Summary

This Swig code generates C++ wrappers for a Perl module, allowing C++ code to interact with the Perl module’s functionality. It defines the interface between C++ and Perl, including data types, function calls, and memory management. The generated C++ code provides a safe and efficient way to use the Perl module from C++.

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

124 sv_2mortal($result);

125 argvi++;

126 }

127 %typecheck(SWIG_TYPECHECK_LIST) list<T> {

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

277 sv_2mortal($result);

278 argvi++;

279 }

280 %typecheck(SWIG_TYPECHECK_LIST) list<T> {

tree.h (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ Header · 118 lines

75 foundNode = ((csTreeNode*)children.Get (i))->DSF (TreeFunc, SelBranch,

76 param, stopOnSuccess);

77 i++;

78 }

79 return foundNode;

csvector.cpp (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ · 189 lines

135 {

136 while ((i != x) && (Compare (Get (i), Get (x), Mode) < 0))

137 i++;

138 while ((j != x) && (Compare (Get (j), Get (x), Mode) > 0))

139 j--;

148 if (i <= j)

149 {

150 i++;

151 if (j > Left)

152 j--;

grxlib.c (https://rxvt.svn.sourceforge.net/svnroot/rxvt) C · 168 lines ✨ Summary

This C code is a graphics library for Unix-like systems, specifically designed to work with rxvt terminals. It provides functions for creating and managing windows, placing text, filling areas, and clearing the screen. The library also handles terminal settings and queries the terminal for available graphics capabilities. It can be used to create graphical user interfaces or other interactive applications.

85 {

86 int ret = 1;

87 i++;

88 switch (line[i]) {

89 case 'R': ret++;

wad_sdl.cpp (https://marathon.svn.sourceforge.net/svnroot/marathon) C++ · 123 lines

77 return true;

78 }

79 i++;

80 }

81 return false;

117 return true;

118 }

119 i++;

120 }

121 return false;

preferences_widgets_sdl.cpp (https://marathon.svn.sourceforge.net/svnroot/marathon) C++ · 118 lines

52 FileSpecifier dir = *i + "Themes";

53 finder.Find(dir, WILDCARD_TYPE);

54 i++;

55 }

56

63 FileSpecifier dir = *i;

64 finder.Find(dir, type);

65 i++;

66 }

67 }

m_argv.cpp (https://doomlegacy.svn.sourceforge.net/svnroot/doomlegacy) C++ · 177 lines

89 {

90 strcpy(s,&myargv[i][1]);

91 i++;

92

93 // get the parameter of the command too

byteptr.h (https://doomlegacy.svn.sourceforge.net/svnroot/doomlegacy) C Header · 117 lines

88 // modify their parameters.

89 #define WRITESTRING(p,b) { int tmp_i=0; do { WRITECHAR((p), (b)[tmp_i]); } while ((b)[tmp_i++]); }

90 #define WRITESTRINGN(p,b,n) { int tmp_i=0; do { WRITECHAR((p), (b)[tmp_i]); if (!(b)[tmp_i]) break; tmp_i++; } while (tmp_i<(n)); }

91 #define WRITEMEM(p,s,n) { memcpy((p),(s),(n)); (p)+=(n); }

92

wad_io.c (https://edge.svn.sourceforge.net/svnroot/edge) C · 376 lines

201 return i;

202

203 i++;

204 }

205

236 lumplist[i]->filepos = ftell(fp);

237 fwrite((void*)lumplist[i]->data, sizeof(byte), lumplist[i]->size, fp);

238 i++;

239 }

240

250 fwrite((void*)&lumplist[i]->size, sizeof(int), 1, fp);

251 fwrite((void*)lumplist[i]->name, sizeof(char), 8, fp);

252 i++;

253 }

254

plhershey-unicode-gen.c (https://plplot.svn.sourceforge.net/svnroot/plplot) C · 175 lines

133 }

134 Hershey_old = Hershey[i];

135 i++;

136 }

137

tree.c (https://udeproject.svn.sourceforge.net/svnroot/udeproject) C · 135 lines

115 t->greater = NULL;

116 t->data = n->data;

117 i++;

118 tree->root = t;

119 }

write_pdb.m (https://octave.svn.sourceforge.net/svnroot/octave) Objective C · 296 lines

58 buf(80) = sprintf("\n");

59 fprintf(f, "%s", buf);

60 i++;

61 endwhile

62 endif

274 buf(80) = "\n";

275 fprintf(f, "%s", buf);

276 i++;

277 j++;

278 endwhile

g_data.m (https://octave.svn.sourceforge.net/svnroot/octave) Objective C · 146 lines

80 endif

81 endif

82 i++;

83 ##size(data)

84 endwhile

legend.m (https://octave.svn.sourceforge.net/svnroot/octave) MATLAB · 228 lines

91 dp = 1; \

92 if ($(i+1) != \"\\\"\") { \

93 i++; \

94 printf (\"%s\", $(i)); \

95 } \

172 if (strcmp(deblank(plot_cmd(i,:)), "t"))

173 new_line = [new_line " t " leg];

174 i++;

175 else

176 new_line = [new_line " " deblank(plot_cmd(i,:))];

177 endif;

178 i++;

179 endwhile;

180

convhulln.cc (https://octave.svn.sourceforge.net/svnroot/octave) C++ · 107 lines

90 idx(i,j++)= 1 + qh_pointid(vertex->point);

91 }

92 i++;j=0;

93 }

94 retval(0)=idx;

write_pdb.m (https://octave.svn.sourceforge.net/svnroot/octave) Objective C · 330 lines

67 buf(80) = sprintf("\n");

68 fprintf(f, "%s", buf);

69 i++;

70 endwhile

71 endif

237 fprintf(f, "\n");

238

239 i++;

240 endwhile

241

309 fprintf(f, "\n");

310

311 i++;

312 endwhile

313 endif

write_pdb_quick.m (https://octave.svn.sourceforge.net/svnroot/octave) Objective C · 139 lines

124 buf(80) = "\n";

125 fprintf(f, "%s", buf);

126 i++;

127 j++;

128 endwhile

graph.c (https://felt.svn.sourceforge.net/svnroot/felt) C · 153 lines

83 z = atof (ptr2+1);

84 node [i] = AddNode (x, y, z, constraint, NULL);

85 i++;

86 }

87 else {

aufile.cpp (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ · 195 lines

142 // signed 8 bit

143 *ptr++=dummy0-128;

144 i++;

145 }

146 }

159 dummy1 = Stream; addStream(1);

160 *ptr++=csSndFunc::makeWord(dummy0, dummy1);

161 i++;

162 }

163 }

175 dummy0 = Stream; addStream(1);

176 *ptr++=csSndFunc::ulaw2linear(dummy0);

177 i++;

178 }

179 }

aufile.cpp (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ · 158 lines

104 // datas are stored in unsigned 8 bit but mixer engine only support signed 8 bit

105 *ptr++=dummy0-128;

106 i++;

107 }

108 }

121 dummy1 = Stream; addStream(1);

122 *ptr++=csSndFunc::makeWord(dummy0, dummy1);

123 i++;

124 }

125 }

137 dummy0 = Stream; addStream(1);

138 *ptr++=csSndFunc::ulaw2linear(dummy0);

139 i++;

140 }

141 }

isomater.cpp (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ · 258 lines

200 return i;

201 }

202 i++;

203 }

204 /// no indices free

gradient.cpp (https://crystal.svn.sourceforge.net/svnroot/crystal) C++ · 130 lines

99 {

100 currshade = nextshade;

101 csi++;

102 if (csi < shades.Length())

103 {